-
1 объединение множеств
sum of sets мат., union of setsРусско-английский научно-технический словарь Масловского > объединение множеств
-
2 объединение множеств
1) Mathematics: class union, sum of sets, union of sets2) SAP. unionУниверсальный русско-английский словарь > объединение множеств
-
3 объединение множеств
join of set, sum of sets, union of setsРусско-английский словарь по электронике > объединение множеств
-
4 объединение множеств
join of set, sum of sets, union of setsРусско-английский словарь по радиоэлектронике > объединение множеств
-
5 в общей сложности
. в сумме•We drilled an aggregate (or a total) of 4000 inches [or 4000 inches ( all) in all].
* * *В общей сложности -- altogether, in all, in sum, all told, a total ofAltogether, 17 different configurations were tested.In all, 381 refrigerant-oil mixture data points were used.All told, 6 cylinders were fabricated, encompassing 2 sets of 3 cylinders each.Marriott, for example, has compiled a total of 1485 data points for steam-water flows, accumulated from 14 sources.Русско-английский научно-технический словарь переводчика > в общей сложности
-
6 теорема эквивалентности ядра
теорема экономики благосостояния, вторая фундаментальная — second fundamental theorem of welfare economics
Если предпочтения домашнего хозяйства и множества возможностей производства фирмы выпуклы, а каждый агент действует как получатель цены, то любой оптимальный по Парето исход может достигаться как конкурентное равновесие при условии, что приняты меры по осуществлению соответствующих аккордных трансфертов богатства. — If household preferences and firm production sets are convex, there is a complete set of markets with publicly known prices, and every agent acts as a price taker, then any Pareto optimal outcome can be achieved as a competitive equilibrium if appropriate lump-sum transfers of wealth are arranged.
теорема экономики благосостояния, первая фундаментальная — first fundamental theorem of welfare economics
Если торговля каждым соответствующим товаром осуществляется на рынке при известных ценах (т.е., если существует полное множество рынков) и если домашние хозяйства и фирмы действуют совершенно конкурентно (т.е., как получатели цены), то рыночный исход оптимален по Парето. Другими словами, при полных рынках любое конкурентное равновесие непременно является оптимальным по Парето. — If every relevant good is traded in a market publicly at known prices (i.e., if there is a complete set of markets), and if households and firms act perfectly competitively (i.e., as price takers), then the market outcome is Pareto optimal. That is, when markets are complete, any competitive equilibrium is necessarily Pareto optimal.
Russian-English Dictionary "Microeconomics" > теорема эквивалентности ядра
См. также в других словарях:
Sum-free set — In additive combinatorics and number theory, a subset A of an abelian group G is said to be sum free if the sumset A⊕A is disjoint from A. In other words, A is sum free if the equation a + b = c has no solution with . For example, the set of odd… … Wikipedia
sum — [sum; ] for n. 6 [ so͞om] n. [ME somme < MFr < L summa, fem. of summus, highest, superl. < base of super: see SUPER ] 1. an amount of money [a sum paid in reparation] 2. the whole amount; totality; aggregate [the sum of our experience] 3 … English World dictionary
sum — sum1 W2S3 [sʌm] n ▬▬▬▬▬▬▬ 1¦(money)¦ 2 the sum of something 3 greater/more/better etc than the sum of its parts 4¦(calculation)¦ 5 do your sums 6 in sum ▬▬▬▬▬▬▬ [Date: 1200 1300; : Old French; Origin: summe, from Latin s … Dictionary of contemporary English
Direct sum of groups — In mathematics, a group G is called the direct sum of a set of subgroups {Hi} if each Hi is a normal subgroup of G each distinct pair of subgroups has trivial intersection, and G = <{Hi}>; in other words, G is generated by the subgroups… … Wikipedia
STO-nG basis sets — STO nG basis sets are the minimal basis sets, where n represents the number of primitive Gaussian functions comprising a single basis set. For minimal basis sets, the core and valence orbitals are represented by same number primitive Gaussian fu … Wikipedia
Subset sum problem — In computer science, the subset sum problem is an important problem in complexity theory and cryptography. The problem is this: given a set of integers, does the sum of some non empty subset equal exactly zero? For example, given the set { −7, −3 … Wikipedia
Causal sets — The causal sets programme is an approach to quantum gravity. Its founding principle is that spacetime is fundamentally discrete and that the spacetime points are related by a partial order. This partial order has the physical meaning of the… … Wikipedia
direct sum — noun a union of two disjoint sets in which every element is the sum of an element from each of the disjoint sets (Freq. 1) • Hypernyms: ↑union, ↑sum, ↑join * * * noun : cartesian product herein * * * Math. a composi … Useful english dictionary
Rule of sum — In combinatorics, the rule of sum is a basic counting principle. Stated simply, it is the idea that if we have a ways of doing something and b ways of doing another thing and we can not do both at the same time, then there are a + b ways to… … Wikipedia
Near sets — are disjoint sets that resemble each other. Resemblance between disjoint sets occurs whenever there are observable similarities between the objects in the sets. Similarity is determined by comparing lists of object feature values. Each list of… … Wikipedia
Direct sum — The symbol denotes direct sum; it is also the astrological and astronomical symbol for Earth, and a symbol for the Exclusive disjunction. In mathematics, one can often define a direct sum of objects already known, giving a new one. This is… … Wikipedia